Faster Quantum Number Factoring via Circuit Synthesis

نویسندگان

  • Igor L. Markov
  • Mehdi Saeedi
چکیده

A major obstacle to implementing Shor’s quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible circuits for modular multiplication to individual runs of Shor’s algorithm. Our circuit-synthesis procedure exploits spectral properties of multiplication operators and constructs optimized circuits from the traces of the execution of an appropriate GCD algorithm. Empirically, gate counts are reduced by 4-5 times, and circuit latency is reduced by larger factors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Efficient Genetic Based Methods for Optimizing the Reversible and Quantum Logic Circuits

Various synthesis methods have been proposed in the literature for reversible and quantum logic circuits. However, there are few algorithms to optimize an existing circuit with multiple constraints simultaneously. In this paper, some heuristics in genetic algorithms (GA) to optimize a given circuit in terms of quantum cost, number of gates, location of garbage outputs, and delay, are proposed. ...

متن کامل

Exact Analyses of Computational Time for Factoring in Quantum Computers

We evaluate the exact number of gates for circuits of Shor’s factoring algorithm. We estimate the running time for factoring a large composite such as 576 and 1024 bit numbers by appropriately setting gate operation time. For example, we show that on the condition that each elementary gate is operated within 50 μsec, the running time for factoring 576 bit number is 1 month even if the most effe...

متن کامل

A fast quantum circuit for addition with few qubits

We show how to construct a fast quantum circuit for computing the sum of two n-bit binary numbers with few qubits. The constructed circuit uses O(n/ logn) ancillary qubits and its depth and size are O(logn) and O(n), respectively. The number of ancillary qubits is asymptotically less than that in Draper et al.’s quantum carry-lookahead adder, and the depth and size are asymptotically the same a...

متن کامل

Architecture of a Quantum Multicomputer Optimized for Shor’s Factoring Algorithm

Quantum computers exist, and offer tantalizing possibilities of dramatic increases in computational power, but scaling them up to solve problems that are classically intractable offers enormous technical challenges. Distributed quantum computation offers a way to surpass the limitations of an individual quantum computer. I propose a quantum multicomputer as a form of distributed quantum compute...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1301.3210  شماره 

صفحات  -

تاریخ انتشار 2013